Combinatorial Intricacies of Labeled Fano Planes

نویسنده

  • Metod Saniga
چکیده

Given a seven-element set X = {1, 2, 3, 4, 5, 6, 7}, there are 30 ways to define a Fano plane on it. Let us call a line of such a Fano plane—that is to say an unordered triple from X—ordinary or defective, according to whether the sum of two smaller integers from the triple is or is not equal to the remaining one, respectively. A point of the labeled Fano plane is said to be of the order s, 0 ≤ s ≤ 3, if there are s defective lines passing through it. With such structural refinement in mind, the 30 Fano planes are shown to fall into eight distinct types. Out of the total of 35 lines, nine ordinary lines are of five different kinds, whereas the remaining 26 defective lines yield as many as ten distinct types. It is shown that no labeled Fano plane can have all points of zero-th order, or feature just one point of order two. A connection with prominent configurations in Steiner triple systems is also pointed out.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sink Location Service Based on Fano Plane in Wireless Sensor Networks

Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...

متن کامل

Almost all hypergraphs without Fano planes are bipartite

The hypergraph of the Fano plane is the unique 3-uniform hypergraph with 7 triples on 7 vertices in which every pair of vertices is contained in a unique triple. This hypergraph is not 2-colorable, but becomes so on deleting any hyperedge from it. We show that taking uniformly at random a labeled 3-uniform hypergraph H on n vertices not containing the hypergraph of the Fano plane, H turns out t...

متن کامل

Gorenstein Toric Fano Varieties

We investigate Gorenstein toric Fano varieties by combinatorial methods using the notion of a reflexive polytope which appeared in connection to mirror symmetry. The paper contains generalisations of tools and previously known results for nonsingular toric Fano varieties. As applications we obtain new classification results, bounds of invariants and formulate conjectures concerning combinatoria...

متن کامل

A combinatorial approach to metamaterials discovery

We report a high throughput combinatorial approach to photonic metamaterial optimization. The new approach is based on parallel synthesis and subsequent optical characterization of large numbers of spatially addressable nanofabricated metamaterial samples (libraries) with quasi-continuous variation of design parameters under real manufacturing conditions. We illustrate this method for Fano-reso...

متن کامل

ar X iv : m at h / 05 05 13 6 v 1 [ m at h . C O ] 8 M ay 2 00 5 Reductions of ( v 3 ) configurations

Cubic bipartite graphs with girth at least 6 correspond to symmetric combinatorial (v3) configurations. In 1887 V. Martinetti described a simple reduction method which enables one to reduce each combinatorial (v3) configuration to one from the infinite set of so-called irreducible configurations. The aim of this paper is to show that a slightly extended set of reductions enables one to reduce e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Entropy

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2016